Go top
Paper information

Gaining-sharing knowledge based algorithm for solving stochastic programming problems

P. Agrawal, K. Alnowibet, A.W. Mohamed

Computer, Materials & Continua Vol. 71, nº. 2, pp. 2847 - 2868

Summary:

This paper presents a novel application of metaheuristic algorithms for solving stochastic programming problems using a recently developed gaining sharing knowledge based optimization (GSK) algorithm. The algorithm is based on human behavior in which people gain and share their knowledge with others. Different types of stochastic fractional programming problems are considered in this study. The augmented Lagrangian method (ALM) is used to handle these constrained optimization problems by converting them into unconstrained optimization problems. Three examples from the literature are considered and transformed into their deterministic form using the chance-constrained technique. The transformed problems are solved using GSK algorithm and the results are compared with eight other state-of-the-art metaheuristic algorithms. The obtained results are also compared with the optimal global solution and the results quoted in the literature. To investigate the performance of the GSK algorithm on a real-world problem, a solid stochastic fixed charge transportation problem is examined, in which the parameters of the problem are considered as random variables. The obtained results show that the GSK algorithm outperforms other algorithms in terms of convergence, robustness, computational time, and quality of obtained solutions.


Keywords: Gaining-sharing knowledge based algorithm; metaheuristic algorithms; stochastic programming; stochastic transportation problem


JCR Impact Factor and WoS quartile: 3,860 - Q2 (2021); 3,100 - Q3 (2022)

DOI reference: DOI icon https://doi.org/10.32604/cmc.2022.023126

Published on paper: December 2021.



Citation:
P. Agrawal, K. Alnowibet, A.W. Mohamed, Gaining-sharing knowledge based algorithm for solving stochastic programming problems. Computer, Materials & Continua. Vol. 71, nº. 2, pp. 2847 - 2868, December 2021.